Reverse mathematics, trichotomy, and dichotomy
نویسندگان
چکیده
Using the techniques of reverse mathematics, we analyze the logical strength of statements similar to trichotomy and dichotomy for sequences of reals. Capitalizing on the connection between sequential statements and constructivity, we find computable restrictions of the statements for sequences and constructive restrictions of the original principles. 2010 Mathematics Subject Classification 03B30, 03F35 (primary); 03F60, 30F50 (secondary)
منابع مشابه
Exponential Dichotomy and Trichotomy for Skew-Evolution Semiflows in Banach Spaces
The paper emphasizes the properties of exponential dichotomy and exponential trichotomy for skew-evolution semiflows in Banach spaces, by means of evolution semiflows and evolution cocycles. The approach is from uniform point of view. Some characterizations which generalize classic results are also provided. Mathematics Subject Classification: 34D09
متن کاملDiscrete Asymptotic Behaviors for Skew-Evolution Semiflows on Banach Spaces
The paper emphasizes asymptotic behaviors, as stability, instability, dichotomy and trichotomy for skew-evolution semiflows, defined by means of evolution semiflows and evolution cocycles and which can be considered generalizations for evolution operators and skew-product semiflows. The definition are given in continuous time, but the unified treatment for the characterization of the studied pr...
متن کاملThe Filter Dichotomy Principle Does Not Imply the Semifilter Trichotomy Principle
We answer Blass' question from 1989 of whether the inequality u < g is strictly stronger than the lter dichotomy principle [6, page 36] a rmatively. We show that there is a forcing extension in which every non-meagre lter on ω is ultra by nite-to-one and the semilter trichotomy does not hold. This trichotomy says: every semi lter is either meagre or comeagre or ultra by nite-to-one. The trichot...
متن کاملConnectivity of Boolean satisfiability
In this thesis we are concerned with the solution-space structure of Boolean satisfiability problems, from the view of theoretical computer science, especially complexity theory. We consider the solution graph of Boolean formulas; this is the graph where the vertices are the solutions of the formula, and two solutions are connected iff they differ in the assignment of exactly one variable. For ...
متن کاملON h − TRICHOTOMY OF LINEAR DISCRETE - TIME SYSTEMS IN BANACH SPACES
The aim of this paper is to give characterizations of a general concept of trichotomy of time-varying linear systems described by difference equations with noninvertible operators in Banach spaces. This concept contains as particular cases the classical properties of (uniform and nonuniform) exponential trichotomy and polynomial trichotomy. The approach is motivated by two examples. 2000 Mathem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Logic & Analysis
دوره 4 شماره
صفحات -
تاریخ انتشار 2012